Least-squares formulations for eigenvalue problems associated with linear elasticity
نویسندگان
چکیده
We study the approximation of spectrum least-squares operators arising from linear elasticity. consider a two-field (stress/displacement) and three-field (stress/displacement/vorticity) formulation; other formulations might be analyzed with similar techniques. prove priori estimates we confirm theoretical results simple two-dimensional numerical experiments.
منابع مشابه
Least-Squares Methods for Linear Elasticity
This paper develops least-squares methods for the solution of linear elastic problems in both two and three dimensions. Our main approach is defined by simply applying the L2 norm least-squares principle to a stress-displacement system: the constitutive and the equilibrium equations. It is shown that the homogeneous least-squares functional is elliptic and continuous in the H(div; Ω)d × H1(Ω)d ...
متن کاملLinear Least Squares Problems
A fundamental task in scientific computing is to estimate parameters in a mathematical model from collected data which are subject to errors. The influence of the errors can be reduced by using a greater number of data than the number of unknowns. If the model is linear, the resulting problem is then to “solve” an in general inconsistent linear system Ax = b, where A ∈ Rm×n and m ≥ n. In other ...
متن کاملFirst-Order System Least Squares For Linear Elasticity: Numerical Results
Two first-order system least squares (FOSLS) methods based on L norms are applied to various boundary value problems of planar linear elasticity. Both use finite element discretization and multigrid solution methods. They are two-stage algorithms that solve first for the displacement flux variable (the gradient of displacement, which easily yields the deformation and stress variables), then for...
متن کاملUsing the eigenvalue relaxation for binary least-squares estimation problems
The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact constraint and as such, is a convex problem with polynomial time complexity. Moreover, as a main pratical advantage of this relaxation over the standard Sem...
متن کاملNon-Linear Least-Squares Optimization of Rational Filters for the Solution of Interior Eigenvalue Problems
Rational filter functions improve convergence of contour-based eigensolvers, a popular algorithm family for the solution of the interior eigenvalue problem. We present an optimization method of these rational filters in the Least-Squares sense. Our filters out-perform existing filters on a large and representative problem set, which we show on the example of FEAST. We provide a framework for (n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & mathematics with applications
سال: 2021
ISSN: ['0898-1221', '1873-7668']
DOI: https://doi.org/10.1016/j.camwa.2020.12.013